Simplicial complexes: higher-order spectral dimension and dynamics

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Simplicial Closure and Higher-order Link Prediction

Networks provide a powerful formalism for modeling complex sys-tems, by representing the underlying set of pairwise interactions.But much of the structure within these systems involves interac-tions that take place among more than two nodes at once — forexample, communication within a group rather than person-to-person, collaboration among a team rather than a pair of co-aut...

متن کامل

Towards a Spectral Theory for Simplicial Complexes

Towards a Spectral Theory for Simplicial Complexes

متن کامل

Spectral Sequences on Combinatorial Simplicial Complexes

The goal of this paper is twofold. First, we give an elementary introduction to the usage of spectral sequences in the combinatorial setting. Second we list a number of applications. In the first group of applications the simplicial complex is the nerve of a poset; we consider general posets and lattices, as well as partition-type posets. Our last application is of a different nature: the Sn-qu...

متن کامل

Polynomial Interpolation in Higher Dimension: From Simplicial Complexes to GC Sets

Geometrically characterized (GC) sets were introduced by ChungYao in their work on polynomial interpolation in Rd. Conjectures on the structure of GC sets have been proposed by Gasca-Maeztu for the planar case, and in higher dimension by de Boor and Apozyan-Hakopian. We investigate GC sets in dimension three or more, and show that one way to obtain such sets is from the combinatorics of simplic...

متن کامل

A Dimension-Independent Data Structure for Simplicial Complexes

We consider here the problem of representing non-manifold shapes discretized as d-dimensional simplicial Euclidean complexes. To this aim, we propose a dimension-independent data structure for simplicial complexes, called the Incidence Simplicial (IS) data structure, which is scalable to manifold complexes, and supports efficient navigation and topological modifications. The IS data structure h...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Physics: Complexity

سال: 2020

ISSN: 2632-072X

DOI: 10.1088/2632-072x/ab82f5